Affine-evasive sets modulo a prime

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Affine-evasive Sets Modulo a Prime

In this work, we describe a simple and efficient construction of a large subset S of Fp , where p is a prime, such that the set A(S) for any non-identity affine map A over Fp has small intersection with S . Such sets, called affine-evasive sets, were defined and constructed in [ADL14] as the central step in the construction of non-malleable codes against affine tampering over Fp , for a prime p...

متن کامل

Orders Modulo A Prime

In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...

متن کامل

Subset Sums modulo a Prime

Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?

متن کامل

Congruences modulo Prime Powers

Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f (x) ∈ Z[x]. We establish the congruence p deg f k≡r (mod p α) n k (−1) k f k − r p α ≡ 0 mod p ∞ i=α ⌊n/p i ⌋ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If α > 1 and l, s, t are nonnegative integers with s, t < p, then 1 ⌊n/p α−1 ⌋! k≡r (...

متن کامل

A Note on Subspace Evasive Sets

A subspace-evasive set over a field F is a subset of F that has small intersection with any low-dimensional affine subspace of F. Interest in subspace evasive sets began in the work of Pudlák and Rödl (Quaderni di Matematica 2004). More recently, Guruswami (CCC 2011) showed that obtaining such sets over large fields can be used to construct capacity-achieving list-decodable codes with a constan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2015

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2014.10.015